Finely-Competitive Paging
نویسندگان
چکیده
We construct an online algorithm for paging that achieves an O(r + log k) competitive ratio when compared to an offline strategy that is allowed the additional ability to “rent” pages at a cost of 1=r. In contrast, the competitive ratio of the Marking algorithm for this scenario is O(r log k). Our algorithm can be thought of in the standard setting as having a “fine-grained” competitive ratio, achieving an O(1) ratio when the request sequence consists of a small number of working sets, gracefully decaying to O(log k) as this number in-
منابع مشابه
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach
Recently, Coté et al. [10] proposed an approach for solving the k-server problem on Hierchically Separated Trees (HSTs). In particular, they define a problem on a uniform metric, and show that if an algorithm with a certain refined guarantee exists for it, then one can obtain polylogarithmic (in diameter) competitive factors for the k-server problem on HSTs by solving this problem recursively. ...
متن کاملCompetitive Analysis of Paging: A Survey
This paper is a survey of competitive analysis of paging. We present proofs showing tight bounds for the competitive ratio achievable by any deterministic or randomized online algorithm. We then go on to discuss variations and reenements of the competitive ratio and the insights they give into the paging problem. Finally, we variations to the online paging problem to which competitive analysis ...
متن کاملHeat & Dump: Competitive Distributed Paging
This paper gives a randomized competitive distributed paging algorithm called Heat & Dump. The competitive ratio is logarithmic in the total storage capacity of the network, this is optimal to within a constant factor. This is in contrast to the linear optimal deterministic competitive ratio BFR].
متن کاملBroadcast Disk Paging with a Small Cache
We consider the broadcast disk paging problem when the cache size is 2 and n pages are transmitted. We show an algorithm that is (n 2=(n 2))-competitive and prove that no better competitive ratio is possible.
متن کاملImproved Space Bounds for Strongly Competitive Randomized Paging Algorithms
Paging is a prominent problem in the field of online algorithms. While in the deterministic setting there exist simple and efficient strongly competitive algorithms, in the randomized setting a tradeoff between competitiveness and memory is still not settled. In this paper we address the conjecture in [2], that there exist strongly competitive randomized paging algorithms using o(k) bookmarks, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999